On oriented graphs with minimal skew energy
نویسندگان
چکیده
منابع مشابه
On oriented graphs with minimal skew energy
Let S(Gσ) be the skew-adjacency matrix of an oriented graph Gσ . The skew energy of Gσ is the sum of all singular values of its skew-adjacency matrix S(Gσ). This paper first establishes an integral formula for the skew energy of an oriented graph. Then, it determines all oriented graphs with minimal skew energy among all connected oriented graphs on n vertices with m (n ≤ m < 2(n− 2)) arcs, whi...
متن کاملNew skew equienergetic oriented graphs
Let $S(G^{sigma})$ be the skew-adjacency matrix of the oriented graph $G^{sigma}$, which is obtained from a simple undirected graph $G$ by assigning an orientation $sigma$ to each of its edges. The skew energy of an oriented graph $G^{sigma}$ is defined as the sum of absolute values of all eigenvalues of $S(G^{sigma})$. Two oriented graphs are said to be skew equienergetic iftheir skew energies...
متن کاملSkew Spectra of Oriented Graphs
An oriented graph G is a simple undirected graph G with an orientation σ, which assigns to each edge a direction so that G becomes a directed graph. G is called the underlying graph of G, and we denote by Sp(G) the adjacency spectrum of G. Skew-adjacency matrix S(G) of G is introduced, and its spectrum SpS(G ) is called the skew-spectrum of G . The relationship between SpS(G ) and Sp(G) is stud...
متن کاملskew-spectra and skew energy of various products of graphs
given a graph $g$, let $g^sigma$ be an oriented graph of $g$ with the orientation $sigma$ and skew-adjacency matrix $s(g^sigma)$. then the spectrum of $s(g^sigma)$ consisting of all the eigenvalues of $s(g^sigma)$ is called the skew-spectrum of $g^sigma$, denoted by $sp(g^sigma)$. the skew energy of the oriented graph $g^sigma$, denoted by $mathcal{e}_s(g^sigma)$, is defined as the sum of the n...
متن کاملAbout Skew Partitions in Minimal Imperfect Graphs
For terms not defined here, the reader is referred to [6]. For a graph G=(V, E), we denote by G the complement of G. We use |(G) to denote the size of a largest clique in G and :(G) to denote the size of a largest stable set in G, or simply | and : when no confusion is possible. A graph G is said to be perfect if, for each induced subgraph H of G, H can be coloured with |(H) colours such that e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Linear Algebra
سال: 2014
ISSN: 1081-3810
DOI: 10.13001/1081-3810.1961